Appendix: Kernelized Online Imbalanced Learning with Fixed Budgets
نویسندگان
چکیده
Junjie Hu, Haiqin Yang, Irwin King, Michael R. Lyu, and Anthony Man-Cho So Shenzhen Key Laboratory of Rich Media Big Data Analytics and Applications Shenzhen Research Institute, The Chinese University of Hong Kong Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Hong Kong {jjhu, hqyang, king, lyu}@cse.cuhk.edu.hk, [email protected]
منابع مشابه
Kernelized Online Imbalanced Learning with Fixed Budgets
Online learning from imbalanced streaming data to capture the nonlinearity and heterogeneity of the data is significant in machine learning and data mining. To tackle this problem, we propose a kernelized online imbalanced learning (KOIL) algorithm to directly maximize the area under the ROC curve (AUC). We address two more challenges: 1) How to control the number of support vectors without sac...
متن کاملOnline Imbalanced Learning with Kernels
Imbalanced learning, or learning from imbalanced data, is a challenging problem in both academy and industry. Nowadays, the streaming imbalanced data become popular and trigger the volume, velocity, and variety issues of learning from these data. To tackle these issues, online learning algorithms are proposed to learn a linear classifier via maximizing the AUC score. However, the developed line...
متن کاملA Framework of Online Learning with Imbalanced Streaming Data
A challenge for mining large-scale streaming data overlooked by most existing studies on online learning is the skewdistribution of examples over different classes. Many previous works have considered cost-sensitive approaches in an online setting for streaming data, where fixed costs are assigned to different classes, or ad-hoc costs are adapted based on the distribution of data received so fa...
متن کاملAUC Maximization with K-hyperplane
The area under the ROC curve (AUC) is a measure of interest in various machine learning and data mining applications. It has been widely used to evaluate classification performance on heavily imbalanced data. The kernelized AUC maximization machines have established a superior generalization ability compared to linear AUC machines because of their capability in modeling the complex nonlinear st...
متن کاملConfidence-Weighted Bipartite Ranking
Bipartite ranking is a fundamental machine learning and data mining problem. It commonly concerns the maximization of the AUC metric. Recently, a number of studies have proposed online bipartite ranking algorithms to learn from massive streams of class-imbalanced data. These methods suggest both linear and kernel-based bipartite ranking algorithms based on first and second-order online learning...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014